Largest Subsets of Triangles in a Triangulation
نویسندگان
چکیده
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) is convex, (ii) is monotone, (iii) has a bounded total angular change, or (iv) has a bounded negative turning angle. The first, second, and fourth problems are solved in polynomial time, the third problem is NP-hard.
منابع مشابه
Size Analysis of Nearly Regular Delaunay Triangulations
Consider a nearly regular point pattern in which a Delaunay triangulation is comprised of nearly equilateral triangles of the same size. We propose to model this set of points with Gaussian perturbations about a regular mean configuration. By investigating triangle subsets in detail we obtain various distributions of statistics based on size, or squared size of the triangles which is closely re...
متن کاملThe 4-triangles longest-side partition of triangles and linear refinement algorithms
In this paper we study geometrical properties of the iterative 4triangles longest-side partition of triangles (and of a 3-triangles partition), as well as practical algorithms based on these partitions, used both directly for the triangulation refinement problem, and as a basis for point insertion strategies in Delaunay refinement algorithms. The 4-triangles partition is obtained by joining the...
متن کاملGabriel-constrained Parametric Surface Triangulation
The Boundary Representation of a 3D manifold contains FACES (connected subsets of a parametric surface S : R −→ R). In many science and engineering applications it is cumbersome and algebraically difficult to deal with the polynomial set and constraints (LOOPs) representing the FACE. Because of this reason, a Piecewise Linear (PL) approximation of the FACE is needed, which is usually represente...
متن کاملAlgorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملAcute Triangulations of Pentagons
An acute triangulation is a triangulation whose triangles have all their angles less than π 2 . In this paper we prove that i) every planar pentagon can be triangulated into at most 54 acute triangles, and ii) every double pentagon can be triangulated into at most 76 acute triangles.
متن کامل